منابع مشابه
The Smith group of the hypercube graph
The n-cube graph is the graph on the vertex set of ntuples of 0s and 1s, with two vertices joined by an edge if and only if the n-tuples differ in exactly one component. We compute the Smith group of this graph, or, equivalently, the elementary divisors of an adjacency matrix of the graph. ∗This work was partially supported by a grant from the Simons Foundation (#204181 to Peter Sin).
متن کاملThe Automorphism Group of a Hypercube
We present explicitly in this expository note the automorphism group of the hypercube Qd of dimension d as a permutation group acting on its 2 d nodes. This group (Qd) acts on the node set Vd of Qd and thus has degree 2 . It is expressed as the binary operation called exponentiation which combines the two symmetric groups S2 (of degree and order 2) and Sd (of degree d and order d!). Speci cally,
متن کاملOn the Sandpile Group of the Cone of the Hypercube
In this article, we give a partial description of the sandpile group of the cone of the cartesian product of graphs in function of the sandpile group of the cone of their factors. Also, we introduce the concept of uniform homomorphism of graphs and prove that every surjective uniform homomorphism of graphs induces an injective homomorphism between their sandpile groups. As an application of the...
متن کاملMaximality of affine group, and hidden graph cryptosystems
We describe a new algebraic-combinatorial method of public key encryption with a certain similarity to the well known Imai-Matsumoto. We use the general idea to treat vertices of a linguistic graph (see [21] and further references) as messages and use the iterative process to walk on such graph as encryption process. To hide such encryption (graph and walk on it) we will use two affine transfor...
متن کاملOn the Acquisition of Maximality
• Significant correlations between age group and performance for FRs (r=0.55, p<0.001) and PDDs (r=0.56, p<0.001). 2. Truth-Value Judgment Task Methods •Participants: 4yo (18), 5yo (17), 6yo (19), 7yo (11). •Participants were told: “Cookie Monster really likes cookies, but he does NOT like onions.” They were shown pictures of (i) plates of cookies, (ii) onions, or (iii) both cookies and onions....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1999
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181070415